Consensus in complex networks with noisy agents and peer pressure

In this paper we study a discrete time consensus model on connected graph with monotonically increasing peer-pressure and noise perturbed outputs masking hidden state. We assume that each agent maintains constant state presents dynamic output is by random drawn from mean-zero distribution. show ensured in the limit as goes to infinity under certain assumptions term also cannot be exactly recovered even when dynamics are known. The exact nature of distribution computed for simple two vertex results found shown generalize (empirically) more complex structures.